Santa Fe Trail for Artificial Ant with Simulating Annealing – Preliminary Study
نویسندگان
چکیده
The paper deals with a novelty tool for symbolic regression – Analytic Programming (AP) which is able to solve various problems from the symbolic regression domain. One of tasks for it can be setting an optimal trajectory for artificial ant on Santa Fe trail which is main application of Analytic Programming in this paper. In this contribution main principles of AP are described and explained. In second part of the article how AP was used for setting an optimal trajectory for artificial ant according the user requirements is in detail described. An ability to create so called programms, as well as Genetic Programming (GP) or Grammatical Evolution (GE) do, is shown in that part. AP is a superstructure of evolutionary algorithms wich are necessary to run AP. In this contribution Simulated Annealing as an evolutionary algorithm was used to carry preliminary simulations out.
منابع مشابه
The Evolution of Size in Variable Length Representations
In many cases programs length’s increase (known as “bloat”, ‘‘fluff” and increasing “structural complexity”) during artificial evolution. We show bloat is not specific to genetic programming and suggest it is inherent in search techniques with discrete variable length representations using simple static evaluation functions. We investigate the bloating characteristics of three non-population an...
متن کاملWhy Ants are Hard
The problem of programming an artificial ant to follow the Santa Fe trail is used as an example program search space. Previously reported genetic programming, simulated annealing and hill climbing performance is shown not to be much better than random search on the Ant problem. Enumeration of a small fraction of the total search space and random sampling characterise it as rugged with multiple ...
متن کاملGenetic Folding MATLAB Toolbox: Solving Santa Fe Trail Problem
This paper is a primarily attempt to design a toolbox for Genetic Folding algorithm using MATLAB. The toolbox was designed for training ACO in solving Santa Fe Trail problem. However, GF algorithm can encode and decode any type of problem into a linearly folding scheme. For advance or even simple type of problems, a string scheme is encoding to represent a set of operators. GF is a novel algori...
متن کاملHow Santa Fe Ants Evolve
— The Santa Fe Ant model problem has been extensively used to investigate, test and evaluate evolutionary computing systems and methods over the past two decades. There is however no literature on its program structures that are systematically used for fitness improvement, the geometries of those structures and their dynamics during optimization. This paper analyzes the Santa Fe Ant Problem usi...
متن کاملRomero's Pilgrimage to Santa Fe: A Tale of Robot Evolution
Many a researcher in evolutionary robotics would love to have at his or her disposal a real population of bopping critters. We describe the design of a cheap, modular, and adaptable robot and the use of our robot in a real-world version of the Santa Fe trail arti cial ant navigation task. 1 A real robot population for adaptive
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006